Conference Timetabling by Grouping Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
A Hybrid Grouping Genetic Algorithm for Examination Timetabling
In this paper, we present an improvement of the Grouping Genetic Algorithm (GGA) which has been described in [6]. The algorithm has been enhanced with local optimisation techniques which are based on problem-specific heuristics and incorporated into the genetic operators. First experiments on well-known benchmark problems on examination timetabling show that the new hybrid algorithm (HGGA) prod...
متن کاملApplication of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...
متن کاملAn Event Grouping Based Algorithm for University Course Timetabling Problem
This paper presents the study of an event grouping based algorithm for a university course timetabling problem. Several publications which discuss the problem and some approaches for its solution are analyzed. The grouping of events in groups with an equal number of events in each group is not applicable to all input data sets. For this reason, a universal approach to all possible groupings of ...
متن کاملAn Efficient Grouping Genetic Algorithm
Genetic algorithm is an intelligent way for solving combinatorial, NP hard problems and many other problems which cannot be easily solved by applying traditional mathematical formula. The proposed method gives a new variant of the Standard Genetic algorithm which is very simple and will easily find the solution even for complex problems. It implements the concept of grouping to reach the optima...
متن کاملAn Efficient Grouping Genetic Algorithm
Genetic algorithm is an intelligent way for solving combinatorial, NP hard problems and many other problems which cannot be easily solved by applying traditional mathematical formula. The proposed method gives a new variant of the Standard Genetic algorithm which is very simple and will easily find the solution even for complex problems. It implements the concept of
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2003
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.16.406